Local Search Heuristics for the Multidimensional Assignment Problem
نویسندگان
چکیده
The multidimensional assignment problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose several local search heuristics for MAP and select the dominating ones. The results of computational experiments for several instance families are provided and discussed.
منابع مشابه
ar X iv : 0 80 6 . 32 58 v 3 [ cs . D S ] 5 S ep 2 00 8 Local Search Heuristics for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose several local search heuristics for MAP and select the dominating ones. The results of computational experim...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملar X iv : 0 80 6 . 32 58 v 5 [ cs . D S ] 1 4 A pr 2 00 9 Local Search Heuristics for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with t...
متن کاملar X iv : 0 80 6 . 32 58 v 4 [ cs . D S ] 2 0 O ct 2 00 8 Local Search Heuristics for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with t...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کامل